Computationally efficient adaptive time step method for the Cahn–Hilliard equation
نویسندگان
چکیده
منابع مشابه
CompAdaGrad: A Compressed, Complementary, Computationally-Efficient Adaptive Gradient Method
The adaptive gradient online learning method known as AdaGrad has seen widespread use in the machine learning community in stochastic and adversarial online learning problems and more recently in deep learning methods. The method’s full-matrix incarnation offers much better theoretical guarantees and potentially better empirical performance than its diagonal version; however, this version is co...
متن کاملA time-space adaptive method for the Schrödinger equation
In this paper, we present a discretization of the time-dependent Schrödinger equation based on a Magnus–Lanczos time integrator and high-order Gauss– Lobatto finite elements in space. A truncated Galerkin orthogonality is used to obtain duality-based a posteriori error estimates that address the temporal and the spatial error separately. Based on this theory, a space-time adaptive solver for th...
متن کاملA computationally-efficient two-step implementation of the GLRT detector
In this paper, a new two-step implementation of the GLRT is proposed. A disadvantage of the GLRT detector is that it is more computationally complex than the simple AMF detector. Our two-step implementation of the GLRT significantly reduces the computational load with a negligible loss in detection performance.
متن کاملComputationally Efficient Technique for Nonlinear Poisson-Boltzmann Equation
Discretization of non-linear Poisson-Boltzmann Equation equations results in a system of non-linear equations with symmetric Jacobian. The Newton algorithm is the most useful tool for solving non-linear equations. It consists of solving a series of linear system of equations (Jacobian system). In this article, we adaptively define the tolerance of the Jacobian systems. Numerical experiment show...
متن کاملComputationally highly efficient mixture of adaptive filters
We introduce a new combination approach for the mixture of adaptive filters based on the set-membership filtering (SMF) framework. We perform SMF to combine the outputs of several parallel running adaptive algorithms and propose unconstrained, affinely constrained and convexly constrained combination weight configurations. Here, we achieve better trade-off in terms of the transient and steadyst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2017
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2017.02.021